Bounds for the minimum distance function
نویسندگان
چکیده
Abstract Let I be a homogeneous ideal in polynomial ring S . In this paper, we extend the study of asymptotic behavior minimum distance function δ and give bounds for its stabilization point, r , when is an F -pure or square-free monomial ideal. These are related with dimension Castelnuovo–Mumford regularity
منابع مشابه
Bounds for the minimum distance in constacyclic codes
In algebraic coding theory it is common practice to require that (n, q) = 1, where n is the word length and F = GF(q) is the alphabet. In this paper, which is about constacyclic codes, we shall stick to this practice too. Since linear codes have the structure of linear subspaces of F , an alternative description of constacyclic codes in terms of linear algebra appears to be another quite natura...
متن کاملMinimum-distance bounds by graph analysis
The parity-check matrix of a linear code is used to define a bipartite code constraint (Tanner) graph in which bit nodes are connected to parity check nodes. The connectivity properties of this graph are analyzed using both local connectivity and the eigenvalues of the associated adjacency matrix. A simple lower bound on minimum distance of the code is expressed in terms of the two largest eige...
متن کاملNew minimum distance bounds for linear codes over GF(5)
Let [n; k; d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d over GF(q). In this paper, 32 new codes over GF(5) are constructed and the nonexistence of 51 codes is proved. c © 2003 Elsevier B.V. All rights reserved.
متن کاملMinimum distance and pseudodistance lower bounds for generalised LDPC codes
Abstract: Two different ways of obtaining generalized low-density parity-check codes are considered. Lower bounds on the minimum distance, stopping distance, and pseudodistance are derived for these codes using graph based analysis. These bounds are generalizations of Tanner’s bit-oriented and parity-oriented bound for simple LDPC codes. The new bounds are useful in predicting the performance o...
متن کاملLower bounds on the minimum average distance of binary codes
Let β(n,M) denote the minimum average Hamming distance of a binary code of length n and cardinality M. In this paper we consider lower bounds on β(n,M). All the known lower bounds on β(n,M) are useful when M is at least of size about 2n−1/n. We derive new lower bounds which give good estimations when size of M is about n. These bounds are obtained using linear programming approach. In particula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Analele Stiintifice Ale Universitatii Ovidius Constanta-seria Matematica
سال: 2021
ISSN: ['1224-1784', '1844-0835']
DOI: https://doi.org/10.2478/auom-2021-0042